package com.honeywen.mymvc.leetcode;

/**
 * 895. 最大频率栈
 * https://leetcode-cn.com/contest/weekly-contest-99/problems/maximum-frequency-stack/
 * @author wangwei
 * @date 2019/8/10
 */
public class FreqStackTest {

    static class FreqStack {

        // 出现频率高的
        public FreqStack() {


        }

        public void push(int x) {

        }

        public int pop() {
            return 0;

        }
    }


    /**
     * 输入：
     * ["FreqStack","push","push","push","push","push","push","pop","pop","pop","pop"],
     * [[],[5],[7],[5],[7],[4],[5],[],[],[],[]]
     * 输出：[null,null,null,null,null,null,null,5,7,5,4]
     *
     */
    public static void main(String[] args) {
        FreqStack obj = new FreqStack();
        obj.push(5);
        obj.push(7);
        obj.push(5);
        obj.push(7);
        obj.push(4);
        obj.push(5);



    }

}
